Reasoning about Partially Ordered Events in the Event Calculus
نویسنده
چکیده
The paper deals with the problem of reasoning about partially ordered events in Kowalski and Sergot's Event Calculus (EC). We home in on EC between its skeptical (SKEC) and credulous (CREC) variants. When only partial knowledge about event ordering is given SKEC and CREC compute the set of maximal validity intervals (MVIs) over which the considered properties are necessarily and possibly true, respectively. The results obtainable with these two variants are amenable of a rather intuitive modal logic interpretation: SKEC computes all MVIs that will be true in whatever completion of the given partial ordering, while CREC derives those MVIs that are true in at least one completion of the given ordering. Finally, the practical relevance of the calculi is shown on a diagnostic case study.
منابع مشابه
A Graph-Theoretic Approach to Efficiently Reason about Partially Ordered Events in the Event Calculus
In this paper, we exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. ...
متن کاملA Modal Calculus of Partially
This paper proposes a modal logic reconstruction of temporal reasoning about partially ordered events in a logic programming framework. It considers two variants of Kowalski and Sergot's Event Calculus (EC): the Skeptical EC (SKEC) and the Credulous EC (CREC). In the presence of partially ordered sequences of events, SKEC and CREC derive the maximal validity intervals over which the relevant pr...
متن کاملEvent Calculus
The event calculus [45, 66, 74, 98, 100] is a formalism for reasoning about action and change. Like the situation calculus, the event calculus has actions, which are called events, and time-varying properties or fluents. In the situation calculus, performing an action in a situation gives rise to a successor situation. Situation calculus actions are hypothetical, and time is tree-like. In the e...
متن کاملSpeeding up Temporal Reasoning by Exploiting the Notion of Kernel of an Ordering Relation
In this paper, we consider the problem of expediting temporal reasoning about partially ordered events in Kowalski and Sergot's Event Calculus (EC). EC is a formalism for representing and reasoning about events and their effects in a logic programming framework [7]. Given a set of events occurring in the real world, EC is able to infer the set of maximal validity intervals (MVIs, hereinafter) o...
متن کاملPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
In this paper, we show how well-known graph-theoretic techniques can be successfully exploited to efficiently reason about partially ordered events in Kowalski and Sergot’s Event Calculus and in its skeptical and credulous modal variants. We replace the traditional generate-and-test strategy of basic Event Calculus by a generate-only strategy that operates on the transitive closure and reductio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994